On the average sensitivity of laced Boolean functions
نویسنده
چکیده
In this paper we obtain the bound on the average sensitivity of the weighted sum function. This confirms a conjecture of Shparlinski. We also compute the weights of the weighted sum functions and show that they are almost balanced.
منابع مشابه
Laced Boolean functions and subset sum problems in finite fields
In this paper, we investigate some algebraic and combinatorial properties of a special Boolean function on n variables, defined using weighted sums in the residue ring modulo the least prime p ≥ n. We also give further evidence to a question raised by Shparlinski regarding this function, by computing accurately the Boolean sensitivity, thus settling the question for prime number values p = n. F...
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملOn the Sensitivity to Noise of a Boolean Function
In this paper we generate upper and lower bounds for the sensitivity to noise of a Boolean function using relaxed assumptions on input choices and noise. The robustness of a Boolean network to noisy inputs is related to the average sensitivity of that function. The average sensitivity measures how sensitive to changes in the inputs the output of the function is. The average sensitivity of Boole...
متن کاملBounds on the Average Sensitivity of Nested Canalizing Functions
Nested canalizing Boolean functions (NCF) play an important role in biologically motivated regulatory networks and in signal processing, in particular describing stack filters. It has been conjectured that NCFs have a stabilizing effect on the network dynamics. It is well known that the average sensitivity plays a central role for the stability of (random) Boolean networks. Here we provide a ti...
متن کاملAverage Sensitivity and Noise Sensitivity of Polynomial Threshold Functions
We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of degree-d polynomial threshold functions (PTFs). These bounds hold both for PTFs over the Boolean hypercube {−1, 1}n and for multilinear PTFs over R n under the standard n-dimensional Gaussian distribution N (0, In). Our bound on the Boolean average sensitivity of PTFs represents progress towards the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1108.3198 شماره
صفحات -
تاریخ انتشار 2011